动态面部表达识别（FER）数据库为情感计算和应用提供了重要的数据支持。但是，大多数FER数据库都用几个基本的相互排斥性类别注释，并且仅包含一种模式，例如视频。单调的标签和模式无法准确模仿人类的情绪并实现现实世界中的应用。在本文中，我们提出了MAFW，这是一个大型多模式复合情感数据库，野外有10,045个视频Audio剪辑。每个剪辑都有一个复合的情感类别和几个句子，这些句子描述了剪辑中受试者的情感行为。对于复合情绪注释，每个剪辑都被归类为11种广泛使用的情绪中的一个或多个，即愤怒，厌恶，恐惧，幸福，中立，悲伤，惊喜，蔑视，焦虑，焦虑，无助和失望。为了确保标签的高质量，我们通过预期最大化（EM）算法来滤除不可靠的注释，然后获得11个单标签情绪类别和32个多标签情绪类别。据我们所知，MAFW是第一个带有复合情感注释和与情感相关的字幕的野外多模式数据库。此外，我们还提出了一种新型的基于变压器的表达片段特征学习方法，以识别利用不同情绪和方式之间表达变化关系的复合情绪。在MAFW数据库上进行的广泛实验显示了所提出方法的优势，而不是其他最先进的方法对单型和多模式FER的优势。我们的MAFW数据库可从https://mafw-database.github.io/mafw公开获得。

深度神经网络的兴起为优化推荐系统提供了重要的驱动力。但是，推荐系统的成功在于精致的建筑制造，因此呼吁神经建筑搜索（NAS）进一步改善其建模。我们提出了NASREC，它是一种训练单个超级网的范式，并通过重量共享有效地产生丰富的模型/子构造。为了克服数据多模式和体系结构异质性挑战，NASREC建立了一个大型的超级网（即搜索空间），以搜索完整的体系结构，而SuperNet结合了多功能操作员的选择和密集的连接性选择，并使人类的密集连接性最小化。 Nasrec的规模和异质性在搜索中构成了挑战，例如训练效率低下，操作员不平衡和降级等级相关性。我们通过提出单操作员任何连接采样，操作员平衡互动模块和训练后微调来应对这些挑战。我们对三个点击率（CTR）预测基准测试的结果表明，NASREC可以胜过手动设计的模型和现有的NAS方法，从而实现最先进的性能。

最近，许多半监督的对象检测（SSOD）方法采用教师学生框架并取得了最新的结果。但是，教师网络与学生网络紧密相结合，因为教师是学生的指数移动平均值（EMA），这会导致表现瓶颈。为了解决耦合问题，我们为SSOD提出了一个周期自我训练（CST）框架，该框架由两个老师T1和T2，两个学生S1和S2组成。基于这些网络，构建了一个周期自我训练机制​​，即S1 $ {\ rightarrow} $ t1 $ {\ rightArow} $ s2 $ {\ rightArrow} $ t2 $ {\ rightArrow} $ s1。对于S $ {\ Rightarrow} $ T，我们还利用学生的EMA权重来更新老师。对于t $ {\ rightarrow} $ s，而不是直接为其学生S1（S2）提供监督，而是老师T1（T2）为学生S2（S1）生成伪标记，从而松散耦合效果。此外，由于EMA的财产，老师最有可能积累学生的偏见，并使错误变得不可逆转。为了减轻问题，我们还提出了分配一致性重新加权策略，在该策略中，根据教师T1和T2的分配一致性，将伪标记重新加权。通过该策略，可以使用嘈杂的伪标签对两个学生S2和S1进行训练，以避免确认偏见。广泛的实验证明了CST的优势，通过将AP比基线优于最先进的方法提高了2.1％的绝对AP改进，并具有稀缺的标记数据，而胜过了2.1％的绝对AP。

内核岭回归（KRR）最近引起了新的兴趣，因为它可以解释在神经网络训练期间出现的瞬态效应，例如双重下降。在这项工作中，我们研究目标函数与内核之间的对齐方式如何影响KRR的性能。我们专注于截短的KRR（TKRR），该KRR（TKRR）利用一个控制核矩阵的光谱截断的附加参数。我们表明，对于多项式对齐，有一个\ emph {过度对准}制度，其中TKRR可以实现比Full KRR可以实现的要快的速度。 TKRR的速率可以一直提高到参数速率，而全krr的速率则以亚最佳值的限制。这表明，通过在内核方法中利用光谱截断，可以更好地利用目标alignemnt。我们还考虑了带有限制的对准设置，并表明TKRR的正则化表面可以表现出瞬态效应，包括多个下降和非单调行为。我们的结果表明，\ emph {对齐谱}的形状与内核方法的概括性能之间存在很强的关系，无论是在速率和有限样品方面。

深度学习（DL）模型为各种医学成像基准挑战提供了最先进的性能，包括脑肿瘤细分（BRATS）挑战。然而，局灶性病理多隔室分割（例如，肿瘤和病变子区）的任务特别具有挑战性，并且潜在的错误阻碍DL模型转化为临床工作流程。量化不确定形式的DL模型预测的可靠性，可以实现最不确定的地区的临床审查，从而建立信任并铺平临床翻译。最近，已经引入了许多不确定性估计方法，用于DL医学图像分割任务。开发指标评估和比较不确定性措施的表现将有助于最终用户制定更明智的决策。在本研究中，我们探索并评估在Brats 2019-2020任务期间开发的公制，以对不确定量化量化（Qu-Brats），并旨在评估和排列脑肿瘤多隔室分割的不确定性估计。该公制（1）奖励不确定性估计，对正确断言产生高置信度，以及在不正确的断言处分配低置信水平的估计数，（2）惩罚导致更高百分比的无关正确断言百分比的不确定性措施。我们进一步基准测试由14个独立参与的Qu-Brats 2020的分割不确定性，所有这些都参与了主要的Brats细分任务。总体而言，我们的研究结果证实了不确定性估计提供了分割算法的重要性和互补价值，因此突出了医学图像分析中不确定性量化的需求。我们的评估代码在HTTPS://github.com/ragmeh11/qu-brats公开提供。

基于随机差分方程（SDE）的挥发性可再生能源（RESS）的随机过程模型共同捕获了连续时间的不断变化的概率分布和时间相关性。它已经使最近的研究能够显着提高动力系统动态不确定性量化和优化的性能。然而，考虑到PV的非同质随机过程性质，仍然存在一个具有挑战性的问题：如何获得用于光伏电源的现实和准确的SDE模型，以反映其在线操作中的天气不确定性，特别是在高分辨率数值时天气预报（NWP）对于许多分布式工厂不可用？为了填补这个差距，本文发现，只有使用来自低分辨率公共天气报告的廉价数据，可以构建精确的PV电源SDE模型。具体地，构建每小时参数化的Jacobi扩散过程以在一天内重新创建PV挥发性的时间模式。它的参数使用极端学习机（ELM）的集合来映射到公共天气报告，以反映不同的天气状况。 SDE模型共同捕捉盘流道和陷阱。基于澳门收集的现实数据的统计检验表明，所提出的方法优于一系列最先进的深度学习的时间系列预测方法。

Increasing research interests focus on sequential recommender systems, aiming to model dynamic sequence representation precisely. However, the most commonly used loss function in state-of-the-art sequential recommendation models has essential limitations. To name a few, Bayesian Personalized Ranking (BPR) loss suffers the vanishing gradient problem from numerous negative sampling and predictionbiases; Binary Cross-Entropy (BCE) loss subjects to negative sampling numbers, thereby it is likely to ignore valuable negative examples and reduce the training efficiency; Cross-Entropy (CE) loss only focuses on the last timestamp of the training sequence, which causes low utilization of sequence information and results in inferior user sequence representation. To avoid these limitations, in this paper, we propose to calculate Cumulative Cross-Entropy (CCE) loss over the sequence. CCE is simple and direct, which enjoys the virtues of painless deployment, no negative sampling, and effective and efficient training. We conduct extensive experiments on five benchmark datasets to demonstrate the effectiveness and efficiency of CCE. The results show that employing CCE loss on three state-of-the-art models GRU4Rec, SASRec, and S3-Rec can reach 125.63%, 69.90%, and 33.24% average improvement of full ranking NDCG@5, respectively. Using CCE, the performance curve of the models on the test data increases rapidly with the wall clock time, and is superior to that of other loss functions in almost the whole process of model training.

When using LiDAR semantic segmentation models for safety-critical applications such as autonomous driving, it is essential to understand and improve their robustness with respect to a large range of LiDAR corruptions. In this paper, we aim to comprehensively analyze the robustness of LiDAR semantic segmentation models under various corruptions. To rigorously evaluate the robustness and generalizability of current approaches, we propose a new benchmark called SemanticKITTI-C, which features 16 out-of-domain LiDAR corruptions in three groups, namely adverse weather, measurement noise and cross-device discrepancy. Then, we systematically investigate 11 LiDAR semantic segmentation models, especially spanning different input representations (e.g., point clouds, voxels, projected images, and etc.), network architectures and training schemes. Through this study, we obtain two insights: 1) We find out that the input representation plays a crucial role in robustness. Specifically, under specific corruptions, different representations perform variously. 2) Although state-of-the-art methods on LiDAR semantic segmentation achieve promising results on clean data, they are less robust when dealing with noisy data. Finally, based on the above observations, we design a robust LiDAR segmentation model (RLSeg) which greatly boosts the robustness with simple but effective modifications. It is promising that our benchmark, comprehensive analysis, and observations can boost future research in robust LiDAR semantic segmentation for safety-critical applications.

In recent years, arbitrary image style transfer has attracted more and more attention. Given a pair of content and style images, a stylized one is hoped that retains the content from the former while catching style patterns from the latter. However, it is difficult to simultaneously keep well the trade-off between the content details and the style features. To stylize the image with sufficient style patterns, the content details may be damaged and sometimes the objects of images can not be distinguished clearly. For this reason, we present a new transformer-based method named STT for image style transfer and an edge loss which can enhance the content details apparently to avoid generating blurred results for excessive rendering on style features. Qualitative and quantitative experiments demonstrate that STT achieves comparable performance to state-of-the-art image style transfer methods while alleviating the content leak problem.

In the scenario of black-box adversarial attack, the target model's parameters are unknown, and the attacker aims to find a successful adversarial perturbation based on query feedback under a query budget. Due to the limited feedback information, existing query-based black-box attack methods often require many queries for attacking each benign example. To reduce query cost, we propose to utilize the feedback information across historical attacks, dubbed example-level adversarial transferability. Specifically, by treating the attack on each benign example as one task, we develop a meta-learning framework by training a meta-generator to produce perturbations conditioned on benign examples. When attacking a new benign example, the meta generator can be quickly fine-tuned based on the feedback information of the new task as well as a few historical attacks to produce effective perturbations. Moreover, since the meta-train procedure consumes many queries to learn a generalizable generator, we utilize model-level adversarial transferability to train the meta-generator on a white-box surrogate model, then transfer it to help the attack against the target model. The proposed framework with the two types of adversarial transferability can be naturally combined with any off-the-shelf query-based attack methods to boost their performance, which is verified by extensive experiments.